Online optimization of busy time on parallel machines
نویسندگان
چکیده
منابع مشابه
Online Optimization of Busy Time on Parallel Machines - (Extended Abstract)
We consider the following online scheduling problem in which the input consists of n jobs to be scheduled on identical machines of bounded capacity g (the maximum number of jobs that can be processed simultaneously on a single machine). Each job is associated with a release time and a completion time between which it is supposed to be processed. When a job is released, the online algorithm has ...
متن کاملOnline Optimization of Busy Time on Parallel Machines⋆
We consider the following online scheduling problem in which the input consists of n jobs to be scheduled on identical machines of bounded capacity g (the maximum number of jobs that can be processed simultaneously on a single machine). Each job is associated with a release time and a completion time between which it is supposed to be processed. When a job is released, the online algorithm has ...
متن کاملOnline Optimization of Busy Time on Parallel
We consider the following online scheduling problem in which the input consists of n jobs to be scheduled on identical machines of bounded capacity g (the maximum number of jobs that can be processed simultaneously on a single machine). Each job is associated with a release time and a completion time between which it is supposed to be processed. When a job is released, the online algorithm has ...
متن کاملOnline Over Time Scheduling on Parallel-Batch Machines: A Survey
Online scheduling is a rapidly developed branch in scheduling theory. In this paper, we present an extensive survey for online over time scheduling on parallel-batch machines. Some open problems are proposed for further research.
متن کاملBusy-Time Scheduling on a Bounded Number of Machines
In this paper we consider a basic scheduling problem called the busy time scheduling problem given n jobs, with release times rj , deadlines dj and processing times pj , and m machines, where each machine can run up to g jobs concurrently, our goal is to find a schedule to minimize the sum of the “on” times for the machines. We develop the first correct constant factor online competitive algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.07.017